Lattice‐based unidirectional Proxy Re‐Encryption and Proxy Re‐Encryption + schemes
نویسندگان
چکیده
منابع مشابه
What about Bob? The Inadequacy of CPA Security for Proxy Reencryption
Consider three parties: Alice, Bob, and Polly. Alice keeps some encrypted data that she can decrypt with a secret key known to her. She wants to communicate the data to Bob, but not to Polly (nor anybody else). Assuming Alice knows Bob’s public key, how can she communicate the data to him? Proxy reencryption provides an elegant answer: Alice creates a reencryption key that will enable Polly (th...
متن کاملA Study of Practical Proxy Reencryption with a Keyword Search Scheme considering Cloud Storage Structure
Data outsourcing services have emerged with the increasing use of digital information. They can be used to store data from various devices via networks that are easy to access. Unlike existing removable storage systems, storage outsourcing is available to many users because it has no storage limit and does not require a local storage medium. However, the reliability of storage outsourcing has b...
متن کاملEfficient Unidirectional Proxy Re-Encryption
Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only needs a re-encryption key given by Alice, and cannot learn anything about the plaintext encrypted. This adds flexibility in various applications, such as confidential email, digital right management and distributed storage. In...
متن کاملUnidirectional Chosen - Ciphertext Secure Proxy
In 1998, Blaze, Bleumer and Strauss introduced a cryptographic primitive called proxy re-encryption (PRE) in which a proxy can transform – without seeing the plaintext – a ciphertext encrypted under one key into an encryption of the same plaintext under another key. The concept has recently drawn renewed interest. Notably, Canetti and Hohenberger showed how to properly define (and realize) chos...
متن کاملPartial Proxy Simulation Schemes
We consider a generic framework which allows to calculate robust Monte-Carlo sensitivities seamlessly through simple finite difference approximation. The method proposed is a generalization and improvement of the proxy simulation scheme method (Fries and Kampen, 2005). As a benchmark we apply the method to the pricing of digital caplets and target redemption notes using LIBOR and CMS indices un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Information Security
سال: 2020
ISSN: 1751-8717,1751-8717
DOI: 10.1049/ise2.12000